curried function การใช้

• Some programming languages almost always use curried functions to achieve multiple arguments; notable examples are Haskell, where in both cases all functions have exactly one argument.
• In practice, the programming technique of closures can be used to perform partial application and a kind of currying, by hiding arguments in an environment that travels with the curried function.
• The ?! operator is often considered right-associative, so the curried function type X \ to ( Y \ to Z ) is often written as X \ to Y \ to Z.
• Curried functions may be used in any programming language that supports closures; however, uncurried functions are generally preferred for efficiency reasons, since the overhead of partial application and closure creation can then be avoided for most function calls.
• When working with curried functions it is customary to use prefix notation with function application considered left-associative, since juxtaposition of multiple arguments as in ( " f " " x " " y " )  naturally maps to evaluation of a curried function.
• When working with curried functions it is customary to use prefix notation with function application considered left-associative, since juxtaposition of multiple arguments as in ( " f " " x " " y " )  naturally maps to evaluation of a curried function.
• That is, while an evaluation of the first function might be represented as f ( 1, 2, 3 ), evaluation of the curried function would be represented as f _ \ text { curried } ( 1 ) ( 2 ) ( 3 ), applying each argument in turn to a single-argument function returned by the previous invocation.